Conference Proceedings

Efficient Mining of Outlying Sequence Patterns for Analyzing Outlierness of Sequence Data

T Wang, L Duan, G Dong, Z Bao

ACM Transactions on Knowledge Discovery from Data | ASSOC COMPUTING MACHINERY | Published : 2020

Abstract

Recently, a lot of research work has been proposed in different domains to detect outliers and analyze the outlierness of outliers for relational data. However, while sequence data is ubiquitous in real life, analyzing the outlierness for sequence data has not received enough attention. In this article, we study the problem of mining outlying sequence patterns in sequence data addressing the question: given a query sequence s in a sequence dataset D, the objective is to discover sequence patterns that will indicate the most unusualness (i.e., outlierness) of s compared against other sequences. Technically, we use the rank defined by the average probabilistic strength (aps) of a sequence patt..

View full abstract

University of Melbourne Researchers

Grants

Awarded by Google


Funding Acknowledgements

Lei Duan's and Tingting Wang's research was supported in part by the National Natural Science Foundation of China (61972268 and 61572332). Zhifeng Bao's work was partially supported by the Australian Research Council under Grants DP180102050 and DP200102611, a Google Faculty Research Award, and the National Natural Science Foundation of China (91646204).